Continuous pricing algorithms for airline RM: revenue gains and competitive impacts

نویسندگان

چکیده

Traditionally, airlines have been limited to a set of fixed fare classes and, in turn, price points, distribute their products. The advent IATA’s new distribution capability (NDC) will soon enable quote any from continuous range. In theory, such pricing could increase revenues by extracting more the consumer surplus, through its ability offer granular fares, closer customer’s willingness-to-pay (WTP). this article, we describe several algorithms that lead quotation single These either rely on traditional for purpose forecasting and optimization (class-based), or completely abandon notion classes, instead assuming different WTP distributions within each booking period prior departure (classless). We how these build upon differ RM counterparts. Performance heuristics is then benchmarked against class-based RM, competitive impacts are analyzed when adopted one airline asymmetrically both symmetrically hypothetical 2-carrier network passenger origin–destination simulator (PODS). find generally revenue-positive, revenue gains can be as high 2.0% first-mover reach up 1.2% adopt method. addition, show depend number structure used baseline, they smaller under lower demand-to-capacity ratios.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pricing substitutable flights in airline revenue management

We develop a Markov decision process formulation of a dynamic pricing problem for multiple substitutable flights between the same origin and destination, taking into account customer choice among the flights. The model is rendered computationally intractable for exact solution by its multidimensional state and action spaces, so we develop and analyze various bounds and heuristics. We first desc...

متن کامل

Competitive Algorithms for Online Pricing

Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(·) such that vi(x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the pr...

متن کامل

Maximizing revenue in the airline industry under one-way pricing

The paper describes a methodology that has been implemented in a major British airline to find the optimal price to charge for airline tickets under one-way pricing. An analytical model has been developed to describe the buying behaviour of customers for flights over the selling period. Using this model and a standard analytical method for constrained optimisation, we can find an expression for...

متن کامل

Capacity Uncertainty in Airline Revenue Management: Models, Algorithms, and Computations

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

متن کامل

Blindly-competitive Algorithms for Pricing & Bidding

The standard setting for competitive analysis of online algorithms assumes that on-line algorithm knows the past (but not future) inputs, and can optimize its performance by \learning" from mistakes of the past. This framework cannot capture some of the real-life online decision-making, which takes place without full knowledge of past and present inputs. Instead, online algorithm only knows a f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Revenue and Pricing Management

سال: 2021

ISSN: ['1476-6930', '1477-657X']

DOI: https://doi.org/10.1057/s41272-021-00350-x